By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 10, Issue 3, pp. 405-656

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman

pp. 405-421

BibTeX  Abstract Full Text:  PDF

Optimal Multi-Way Search Trees

L. Gotlieb

pp. 422-433

BibTeX  Abstract Full Text:  PDF

Partial and Total Matrix Multiplication

A. Schönhage

pp. 434-455

BibTeX  Abstract Full Text:  PDF

A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems

Richard Schroeppel and Adi Shamir

pp. 456-464

BibTeX  Abstract Full Text:  PDF

Parallel Sorting with Constant Time for Comparisons

Roland Häggkvist and Pavol Hell

pp. 465-472

BibTeX  Abstract Full Text:  PDF

A New Approach to Planar Point Location

Franco P. Preparata

pp. 473-482

BibTeX  Abstract Full Text:  PDF

Uniform Interpretations of Grammar Forms

H. A. Maurer, A. Salomaa, and D. Wood

pp. 483-502

BibTeX  Abstract Full Text:  PDF

Attribute Grammars and Mathematical Semantics

Brian H. Mayoh

pp. 503-518

BibTeX  Abstract Full Text:  PDF

Automatic Programming of Finite State Linear Programs

Amir Pnueli and Giora Slutzki

pp. 519-535

BibTeX  Abstract Full Text:  PDF

Pumping Lemmas for Regular Sets

A. Ehrenfeucht, R. Parikh, and G. Rozenberg

pp. 536-541

BibTeX  Abstract Full Text:  PDF

Worst-Case and Probabilistic Analysis of a Geometric Location Problem

Christos H. Papadimitriou

pp. 542-557

BibTeX  Abstract Full Text:  PDF

Key Comparison Optimal $2$-$3$ Trees with Maximum Utilization

James R. Bitner and Shou-Hsuan Huang

pp. 558-570

BibTeX  Abstract Full Text:  PDF

Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms

Igal Golan

pp. 571-582

BibTeX  Abstract Full Text:  PDF

An Average Time Analysis of Backtracking

Cynthia A. Brown and Paul Walton Purdom, Jr.

pp. 583-593

BibTeX  Abstract Full Text:  PDF

Deadlock-Free Packet Switching Networks

Sam Toueg and Jeffrey D. Ullman

pp. 594-611

BibTeX  Abstract Full Text:  PDF

Corrigendum: Soundness and Completeness of an Axiom System for Program Verification

Stephen A. Cook

p. 612

BibTeX  Abstract Full Text:  PDF

Exegesis of Self-Organizing Linear Search

Gaston H. Gonnet, J. Ian Munro, and Hendra Suwanda

pp. 613-637

BibTeX  Abstract Full Text:  PDF

Computing Sequences with Addition Chains

Peter Downey, Benton Leong, and Ravi Sethi

pp. 638-646

BibTeX  Abstract Full Text:  PDF

Preserving Functional Dependencies

C. Beeri and P. Honeyman

pp. 647-656

BibTeX  Abstract Full Text:  PDF